Information-Aware HyperOctree for Effective Isosurface Rendering of Large Scale Time-Varying Data

نویسنده

  • Joseph JaJa
چکیده

We develop a new indexing structure and a new out-of-core scheme to extract and render isosurfaces for large scale time-varying 3-D volume data. The new algorithm enables the fast visualization of arbitrary isosurfaces cut by a user-specified hyperplane along any of the four dimensions. Our data structure makes use of the entropy measure to establish the relative resolutions of the spatial and temporal dimensions rather than treating the temporal dimension just as any other dimension. The preprocessing is very efficient and the resulting indexing structure is very compact. We have tested our scheme on 40GB subset of the Richtmyer-Meshkov instability data set and obtained very good performance for a wide range of isosurface extraction queries. Index Terms Isosurface extraction and rendering, Indexing methods, Out-of-core techniques, Time-varying fields

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Isosurface Extraction for Large Scale Time-Varying Data Using the Persistent Hyperoctree (PHOT)

We introduce the Persistent HyperOcTree (PHOT) to handle the 4D isocontouring problem for large scale time-varying data sets. This novel data structure is provably space efficient and optimal in retrieving active cells. More importantly, the set of active cells for any possible isovalue are already organized in a Compact Hyperoctree, which enables very efficient slicing of the isocontour along ...

متن کامل

A Novel Information - Aware Octree for the Visualization of Large Scale Time - varying Data

Large scale scientific simulations are increasingly generating very large data sets that present substantial challenges to current visualization systems. In this paper, we develop a new scalable and efficient scheme for the visual exploration of 4-D isosurfaces of time varying data by rendering the 3-D isosurfaces obtained through an arbitrary axis-parallel hyperplane cut. The new scheme is bas...

متن کامل

Fast out-of-core isosurface extraction and rendering of time-varying data sets

We present a combination of techniques for interactive out-of-core isosurface extraction and rendering of time-dependent data sets. We make use of an index tree that allows extraction of all isovalue-spanning cells from any time step, and for any isovalue, at rates of several hundreds of frames per second. This data structure is constructed in a pre-processing stage, and effectively uses the te...

متن کامل

Hardware-assisted View-dependent Isosurface Extraction using Spherical Partition

Extracting only the visible portion of an isosurface can improve both the computation efficiency and the rendering speed. However, the visibility test overhead can be quite high for large scale data sets. In this paper, we present a view-dependent isosurface extraction algorithm utilizing occlusion query hardware to accelerate visible isosurface extraction. A spherical partition scheme is propo...

متن کامل

Parallel Algorithms for Volumetric Surface Construction

Large scale scientific data sets are appearing at an increasing rate whose sizes can range from hundreds of gigabytes to tens of terabytes. Isosurface extraction and rendering is an important visualization technique that enables the visual exploration of such data sets using surfaces. However the computational requirements of this approach are substantial which in general prevent the interactiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006